Matrix Graph Grammars

Matrix Graph Grammars and Monotone Complex Logics

Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGGs) as a purely algebraic approach for the study of graph grammars and graph dynamics, based on the representation of graphs by means of their adjacency matrices. MGGs ...

Graph Field Automata

The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \cite{Pedro} are an algebratization of graph rewriting systems. Here we present the dual of this formalizm which some extensions which we term Graph Field Automata The advantage to this approach is a framework for expressing machines that can use Matrix Graph Grammars.

Refining the Nonterminal Complexity of Graph-controlled Grammars

We refine the classical notion of the nonterminal complexity of graph-controlled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable language can be generated by a graph-controlled grammar with only two nonterminal symbols when both s...

A Reformulation of Matrix Graph Grammars with Boolean Complexes

Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGG) as a purely algebraic approach for the study of graph dynamics, based on the representation of simple graphs by means of their adjacency matrices. The observation th...

A Cons Apart Automaton Research Project Graph Automata on Galois Fields Specified by Matrix Graph Grammars 1